A Model-Theoretic Framework for Theories of Syntax

نویسنده

  • James Rogers
چکیده

A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism—to express syntactic theories purely in terms of the properties of the class of structures they license. By focusing on the structural properties of languages rather than on mechanisms for generating or checking structures that exhibit those properties, this model-theoretic approach can offer simpler and significantly clearer expression of theories and can potentially provide a uniform formalization, allowing disparate theories to be compared on the basis of those properties. We discuss LK,P , a monadic second-order logical framework for such an approach to syntax that has the distinctive virtue of being superficially expressive—supporting direct statement of most linguistically significant syntactic properties—but having well-defined strong generative capacity— languages are definable in LK,P iff they are strongly context-free. We draw examples from the realms of GPSG and GB.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The application and development of graph theory through the space syntax method: The implementation of analytical practical model in architecture

Abstract Over the last few decades, different mathematical methods have been used to design and analyze architectural spaces. Meanwhile, the graph theory provides an abstract model to study the spatial configuration, so that a simple and flexible mathematical framework is obtained to analyze the spatial topological features and their relationship with social and functional concepts in architec...

متن کامل

Preservation theorems in {L}ukasiewicz \model theory

We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...

متن کامل

A Descriptive Characterization of Tree-Adjoining Languages (Full Version)

Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive characterizations have been used to obtain complexity results for constraint-and principle-based theories of syntax and to provide a uniform model-theoretic framework for e...

متن کامل

UCF Technical Report : CS - TR - 98 - 01 A Descriptive Characterization of Tree - Adjoining Languages

Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by deenability in the monadic second-order theory of certain structures. More recently, these descriptive characterizations have been used to obtain complexity results for constraint-and principle-based theories of syntax and to provide a uniform model-theoretic framework for ex...

متن کامل

Description Theory and Approach about Space Syntax Methodology in Urban Design Process

Nowadays space is considered to be a net of connections between different areas. The questions how to delineate its character and how it is possible to objectively compare two spaces is a matter under consideration. This was the reason for creating new theories about the structure of space. Space syntax analysis (SSA) or simply Space Syntax defines a number of theories and research areas devo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996